/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param pRoot TreeNode类 
     * @return bool布尔型
     */
     int height(TreeNode* root)
     {
        if(root == nullptr)
        {
            return 0;
        }
        if(root->left == nullptr && root->right == nullptr)
        {
            return 1;
        }
        return max(height(root->left),height(root->right)) + 1;
     }
    bool Is_Balance(TreeNode* root)
    {
        if(root == nullptr)
        {
            return true;
        }
        if(root->left == nullptr && root->right == nullptr)
        {
            return true;
        }
        int x = height(root->left);
        int y = height(root->right);
        return abs(x-y) <= 1 && Is_Balance(root->left) && Is_Balance(root->right);
    }

    bool IsBalanced_Solution(TreeNode* pRoot) {
        // write code here
        return Is_Balance(pRoot);
    }
};